Parameter Synthesis for Timed Kripke Structures

نویسندگان

  • Michal Knapik
  • Wojciech Penczek
چکیده

We show how to synthesise parameter values under which a given property, expressed in a certain extension of CTL called RTCTLP, holds in a parametric timed Kripke structure. Similarly as in fixed-point symbolic model checking approach, we introduce special operators which stabilise on the solution. The process of stabilisation is essentially a translation from RTCTLP parameter synthesis problem to a discrete optimization task. We argue that this leads to new opportunities in model checking, including the use of integer programming and related tools.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Model Checking Durational Kripke Structures

We consider quantitative model checking in durational Kripke structures (Kripke structures where transitions have integer durations) with timed temporal logics where subscripts put quantitative constraints on the time it takes before a property is satisfied. We investigate the conditions that allow polynomial-time model checking algorithms for timed versions of CTL and exhibit an important gap ...

متن کامل

Efficient timed model checking for discrete-time systems

We consider model checking of timed temporal formulae in durational transition graphs (DTGs), i.e., Kripke structures where transitions have integer durations. Two semantics for DTGs are presented and motivated. We consider timed versions of CTL where subscripts put quantitative constraints on the time it takes before a property is satisfied. We exhibit an important gap between logics where sub...

متن کامل

Parameter Synthesis for Hierarchical Concurrent Real-Time Systems (Full Version)

Modeling and verifying complex real-time systems, involving timing delays, are notoriously difficult problems. Checking the correctness of a system for one particular value for each delay does not give any information for other values. It is hence interesting to reason parametrically, by considering that the delays are parameters (unknown constants) and synthesize a constraint guaranteeing a co...

متن کامل

Weighted Branching Simulation Distance for Parametric Weighted Kripke Structures

Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters (Cassting’16/SynCoP’16). EPTCS 220, 2016, pp. 63–75, doi:10.4204/EPTCS.220.6 c © L. Foshammer, K.G Larsen & A. Mariegaard This work is licensed under the Creative Commons Attribution License. Weighted Branching Simulation Distance for Parametric Weighted Kripke Struc...

متن کامل

LTL Model Checking of Parametric Timed Automata

The parameter synthesis problem for timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The proposed problem could be solved using an explicit enumeration of all possible parameter valuations. However, we introduce a symb...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Fundam. Inform.

دوره 133  شماره 

صفحات  -

تاریخ انتشار 2013